Some aspects of the cyclic reduction algorithm for block tridiagonal linear systems
نویسندگان
چکیده
The solution of a general block tridiagonal linear system by a cyclic odd-even reduction algorithm is considered. Under conditions of diagonal dominance, norms describing the off-diagonal blocks relative to the diagonal blocks decrease quadratically with each reduction. This allows early termination of the reduction when an approximate solution is desired. The algorithm is well-suited for parallel computation.
منابع مشابه
Incomplete Cyclic Reduction of Banded and Strictly Diagonally Dominant Linear Systems
The ScaLAPACK library contains a pair of routines for solving banded linear systems which are strictly diagonally dominant by rows. Mathematically, the algorithm is complete block cyclic reduction corresponding to a particular block partitioning of the system. In this paper we extend Heller’s analysis of incomplete cyclic reduction for block tridiagonal systems to the ScaLAPACK case. We obtain ...
متن کاملA Direct Elliptic Solver Based on Hierarchically Low-rank Schur Complements
Cyclic reduction was conceived for the solution of tridiagonal linear systems, such as the one-dimensional Poisson equation [11]. Generalized to higher dimensions, it is known as block cyclic reduction (BCR) [4]. It can be used for general (block) Toeplitz and (block) tridiagonal linear systems; however, it is not competitive for large problems, because its arithmetic complexity grows superline...
متن کاملFast Banded Linear Equation Solvers
A new algorithm for solving triangular linear equations is reported that is signiicantly faster than conventional methods on vector and parallel architectures for small bandwidths. In essence, it is a block version of the cyclic reduction algorithm used for tridiagonal systems of equations, and is applicable to general banded systems as well.
متن کاملA Parallel Block Cyclic Reduction Algorithm for the Fast Solution of Elliptic Equations
This paper presents an adaptation of the Block Cyclic Reduction (BCR) algorithm for a multi-vector processor. The main bottleneck of BCR lies in the solution of linear systems whose coefficient matrix is the product of tridiagonal matrices. This bottleneck is handled by expressing the rational function corresponding to the inverse of this product as a sum of elementary fractions. As a result th...
متن کاملDivide and Conquer: A New Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
Bondeli, S_, Divide and conquer: a parallel algorithm for the solution of a tridiagonal linear system of equations, Parallel Comput ing 17 (1991) 419-434_ We describe a divide and conquer algorithm which solves linear tridiagonal systems with one right-hand side, especially suited for parallel computers. The algorithm is flexible, permits multiprocessing or a combinat ion of vector and multipro...
متن کامل